Scaling Up Radial Graph Layouts
نویسنده
چکیده
The well-known radial graph layout technique has plenty of advantages for graph visualization and graph exploration, but is quite limited in the size of graphs it can display effectively because the layout is inherently global and allows far away or out of view nodes to distort the focus region. The primary contribution of this project is to introduce sub tree clustering to allow the layout algorithm to run locally and provide a visually pleasing focus region regardless of the overall graph size. This solution builds upon an existing radial graph visualization technique published in Yee et. al.'s Animated Exploration of Graphs with Radial Layout published in Proc. InfoVis 2001. In addition to clustering, other common information visualization techniques are added to Yee et. al.'s solution to further aid with graph navigation and visualization as the graph size increases.
منابع مشابه
A parent-centered radial layout algorithm for interactive graph visualization and animation
We have developed (1) a graph visualization system that allows users to explore graphs by viewing them as a succession of spanning trees selected interactively, (2) a radial graph layout algorithm, and (3) an animation algorithm that generates meaningful visualizations and smooth transitions between graphs while minimizing edge crossings during transitions and in static layouts. Our system is s...
متن کاملGraph Drawing by Classical Multidimensional Scaling: New Perspectives
With shortest-path distances as input, classical multidimensional scaling can be regarded as a spectral graph drawing algorithm, and recent approximation techniques make it scale to very large graphs. In comparison with other methods, however, it is considered inflexible and prone to degenerate layouts for some classes of graphs. We want to challenge this belief by demonstrating that the method...
متن کاملBlow up of the critical norm for some radial L super critical non linear Schrödinger equations
We consider the nonlinear Schrödinger equation iut = −∆u−|u|p−1u in dimension N ≥ 3 in the L super critical range N+3 N−1 ≤ p < N+2 N−2 . The corresponding scaling invariant space is Ḣc with 1 2 ≤ sc < 1 and this covers the physically relevant case N = 3, p = 3. The existence of finite time blow up solutions is known. Let u(t) ∈ Ḣc ∩ Ḣ be a radially symmetric blow up solution which blows up at ...
متن کاملIncreasing the readability of graph drawings with centrality-based scaling
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networks can result in drawings that are not highly readable in the dense areas. Additionally, networks whose layouts are defined geographically often have dense areas that are located within small geographical regions relat...
متن کاملTowards Faithful Graph Visualizations
Readability criteria have been addressed as a measurement of the quality of graph visualizations. In this paper, we argue that readability criteria are necessary but not sufficient. We propose a new kind of criteria, namely faithfulness, to evaluate the quality of graph layouts. We introduce a general model for quantify faithfulness, and contrast it with the well established readability criteri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007